Continuous Time Dynamic Contraflow Models and Algorithms
نویسندگان
چکیده
منابع مشابه
Continuous Time Dynamic Topic Models
In this paper, we develop the continuous time dynamic topic model (cDTM). The cDTM is a dynamic topic model that uses Brownian motion to model the latent topics through a sequential collection of documents, where a “topic” is a pattern of word use that we expect to evolve over the course of the collection. We derive an efficient variational approximate inference algorithm that takes advantage o...
متن کاملEfficient continuous-time dynamic network flow algorithms
We extend the discrete-time dynamic ow algorithms presented in the literature to solve the analogous continuous-time dynamic ow problems. These problems include nding maximum dynamic ows, quickest ows, universally maximum dynamic ows, lexicographically maximum dynamic ows, dynamic transshipments, and quickest transshipments in networks with capacities and transit times on the edges.
متن کاملContinuous-Time Dynamic Shortest Path Algorithms
We consider the problem of computing shortest paths through a dynamic network – a network with time-varying characteristics, such as arc travel times and costs, which are known for all values of time. Many types of networks, most notably transportation networks, exhibit such predictable dynamic behavior over the course of time. Dynamic shortest path problems are currently solved in practice by ...
متن کاملContinuous-time Infinite Dynamic Topic Models
Topic models are probabilistic models for discovering topical themes in collections of documents. In real world applications, these models provide us with the means of organizing what would otherwise be unstructured collections. They can help us cluster a huge collection into different topics or find a subset of the collection that resembles the topical theme found in an article at hand. The fi...
متن کاملSimulation Algorithms for Continuous Time Markov Chain Models
Abstract Continuous time Markov chains are often used in the literature to model the dynamics of a system with low species count and uncertainty in transitions. In this paper, we investigate three particular algorithms that can be used to numerically simulate continuous time Markov chain models (a stochastic simulation algorithm, explicit and implicit tau-leaping algorithms). To compare these m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Operations Research
سال: 2016
ISSN: 1687-9147,1687-9155
DOI: 10.1155/2016/7902460